Constant Time Algorithms for Computing the Contour of Maximal Elements on a Reconfigurable Mesh
نویسندگان
چکیده
منابع مشابه
Constant Time Algorithms for Computing the Contour of Maximal Elements on the Reconfigurable Mesh
A list of technical reports, including some abstracts and copies of some full reports may be found at: TR-CS-97-05 Beat Fischer. Collocation and filtering — a data smoothing method in surveying engineering and geodesy. March 1997. HeROD flavoured oct-trees: Scientific computation with a multicomputer persistent object store. February 1997. Abstract There has recently been an interest in the int...
متن کاملConstant Time Algorithms for Computing the Contour of Maximal Elements on the Recon gurable Mesh
Elements on the Recon gurable Mesh M. Manzur Murshed and Richard P. Brent Computer Sciences Lab, Research School of Information Sciences & Engg. The Australian National University, Canberra ACT 0200, Australia E-mail: fmurshed,[email protected] Abstract There has recently been an interest in the introduction of recon gurable buses to existing parallel architectures. Among them Recon gurable...
متن کاملConstant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recently, this model has attracted a lot of attention. In this paper, we show O(1) time solutions to the following computational geometry problems on the reconfigurable mesh: all-pairs ne...
متن کاملAn improved constant-time algorithm for computing the Radon and Hough transforms on a reconfigurable mesh
The Hough transform is an important problem in image processing and computer vision. Recently, an efficient algorithm for computing the Hough transform has been proposed on a reconfigurable array [12]. For a problem with an p N p N image and an n n parameter space, the algorithm runs in a constant time on a threedimensional (3-D) n n N reconfigurable mesh where the data bus is N1=c-bit wide. To...
متن کاملConstant Time Collision-Free Path Computation on Reconfigurable Mesh
The reconfigurable mesh (R-Mesh) was shown to be a very powerful model capable of extremely fast solutions to many problems. R-Mesh has a wide range of applications such as arithmetic problems, image processing and robotics. The 2D R-Mesh was shown to be able to solve the path planning problem very fast. In this paper, we propose an algorithm to compute a collision-free path between a source an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 1998
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s0129626498000365